A context-free and a 1-counter geodesic language for a Baumslag-Solitar group
نویسنده
چکیده
We give a language of unique geodesic normal forms for the BaumslagSolitar group BS(1, 2) that is context-free and 1-counter. We discuss the classes of context-free, 1-counter and counter languages, and explain how they are inter-related.
منابع مشابه
$\mathcal C$-graph automatic groups
We generalize the notion of a graph automatic group introduced by Kharlampovich, Khoussainov and Miasnikov by replacing the regular languages in their definition with more powerful language classes. For a fixed language class C, we call the resulting groups C-graph automatic. We prove that the class of C-graph automatic groups is closed under change of generating set, direct and free product fo...
متن کاملA Linear-time Algorithm to Compute Geodesics in Solvable Baumslag–solitar Groups
We present an algorithm to convert a word of length n in the standard generators of the solvable Baumslag–Solitar group BS(1, p) into a geodesic word, which runs in linear time and O(n logn) space on a random access machine.
متن کاملNonhyperbolic free-by-cyclic and one-relator groups
We show that the free-by-cyclic groups of the form F2 o Z act properly cocompactly on CAT(0) square complexes. We also show using generalized Baumslag–Solitar groups that all known groups defined by a 2-generator 1-relator presentation are either SQ-universal or are cyclic or isomorphic to a soluble Baumslag–Solitar group.
متن کاملA Logspace Solution to the Word and Conjugacy problem of Generalized Baumslag-Solitar Groups
Baumslag-Solitar groups were introduced in 1962 by Baumslag and Solitar as examples for finitely presented non-Hopfian two-generator groups. Since then, they served as examples for a wide range of purposes. As Baumslag-Solitar groups are HNN extensions, there is a natural generalization in terms of graph of groups. Concerning algorithmic aspects of generalized Baumslag-Solitar groups, several d...
متن کاملDecision and Separability Problems for Baumslag-Solitar Semigroups
We show that the semigroups Sk,` having semigroup presentations 〈a, b : abk = b`a〉 are residually finite and finitely separable. Generally, these semigroups have finite separating images which are finite groups and other finite separating images which are semigroups of order-increasing transformations on a finite partially ordered set. These semigroups thus have vastly different residual and se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 339 شماره
صفحات -
تاریخ انتشار 2005